Two-Machine Shop Scheduling with an Uncapacitated Interstage Transporter

In this paper we study the two-machine flow shop and open shop problems to minimize the makespan with a single interstage transporter that may carry any number of jobs between the machines at a time. For each of these problems we present a best possible approximation algorithm within a class of schedules with at most two shipments. As a by-product of this research, for the problem of minimizing the makespan on parallel identical machines we analyze the ratio of the makespan for a non-preemptive schedule over the makespan of a preemptive schedule.

An improved approximation algorithm for the two-machine flow shop scheduling problem with an interstage transporter

We study the two-machine flow shop problem with an uncapacitated interstage transporter. The jobs have to be split into batches, and upon completion on the first machine, each batch has to be shipped to the second machine by a transporter. The best known heuristic for the problem is a –approximation algorithm that outputs a two-shipment schedule. We design a –approximation algorithm that finds schedules with at most three shipments, and this ratio cannot be improved, unless schedules with more shipments are created. This improvement is achieved due to a thorough analysis of schedules with two and three shipments by means of linear programming. We formulate problems of finding an optimal schedule with two or three shipments as integer linear programs and develop strongly polynomial algorithms that find solutions to their continuous relaxations with a small number of fractional variables

An approximation algorithm for the two-machine flow shop with a single transporter

We study the two-machine flow shop problem with an uncapacitated interstage transporter. The jobs have to be split into batches, and upon completion on the first machine, each batch has to be shipped to the second machine by a transporter. The best known heuristic for the problem is a –approximation algorithm that outputs a two-shipment schedule. We design a –approximation algorithm that finds schedules with at most three shipments, and this ratio cannot be improved, unless schedules with more shipments are created. This improvement is achieved due to a thorough analysis of schedules with two and three shipments by means of linear programming. We formulate problems of finding an optimal schedule with two or three shipments as integer linear programs and develop strongly polynomial algorithms that find solutions to their continuous relaxations with a small number of fractional variables.

Simultaneous monitoring of drug and solvent diffusion across a model membrane using ATR-FTIR spectroscopy

Attenuated total reflectance Fourier transform infrared (ATR-FTIR) spectroscopy has been used to simultaneously follow the diffusion of model drugs and solvent across polydimethylsiloxane (silicone) membrane. Three model drugs, cyanophenol (CNP), methyl nicotinate (MN) and butyl paraben (BP) were selected to cover a range of lipophilicities. Isostearyl isostearate (ISIS) was chosen as the solvent because its large molecular weight should facilitate observation of whether the drug molecules are able to diffuse through the membrane independently of the solvent. The diffusion of the three drugs and the solvent was successfully described by a Fickian model. The effects of parameters such as the absorption wavelength used to follow diffusion on the calculated diffusion coefficient were investigated. Absorption wavelength which affects the depth of penetration of the infrared radiation into the membrane did not significantly affect the calculated diffusion coefficient over the wavelength range tested. Each of the model drugs was observed to diffuse independently of the solvent across the membrane. The diffusion of a CNP-ISIS hydrogen bonded complex across the membrane was also monitored. The relative diffusion rates of the solute and solvent across the membrane can largely be accounted for by the molecular size of the permeant.